A simple linear time algorithm for cograph recognition
نویسندگان
چکیده
منابع مشابه
A simple linear time algorithm for cograph recognition
In this paper, we describe a new simple linear time algorithm to recognize cographs. Cographs are exactly the P4-free graphs (where P4 denotes the path with 4 vertices). The recognition process works in two steps. First, we use partition refinement techniques to produce a factorizing permutation, i.e., an ordering of the vertices in which the strong modules appear consecutively. Then a very sim...
متن کاملA Simple Linear Time LexBFS Cograph Recognition Algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for various families of graphs. In this paper, we add to this work by producing a simple two LexBFS sweep algorithm to recognize the family of cographs. This algorithm extends to other related graph families such as P4-red...
متن کاملParallel Algorithm for Cograph Recognition with Applications
We present a parallel algorithm for recognizing cographs and constructing their cotrees. The algorithm takes O(log 2 n) time with O(n + m) processors on a CRCW PRAM, where n and m are the number of vertices and edges of the graph. Using cotree representation, we obtain parallel algorithms for solving the maximum matching and the permutation representation problems for cographs using O(logn) tim...
متن کاملSimple linear time approximation algorithm for betweenness
We present a simple linear time combinatorial algorithm for the Betweenness problem. In the Betweenness problem, we are given a set of vertices and betweenness constraints. Each betweenness constraint of the form x {y, z} requires that vertex x lies between vertices y and z. Our goal is to find a linear ordering of vertices that maximizes the number of satisfied constraints. In 1995, Chor and S...
متن کاملA Simple Linear-Time Modular Decomposition Algorithm
The first polynomial time algorithm (O(n)) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear-time algorithms [22, 7, 23, 9]. Although having optimal time complexity these algorithms are quite complicated and difficult to implement. In this paper we present an easily implementable linear-time algorithm for modul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.01.011